A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
نویسندگان
چکیده
We show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering by giving a procedure for solving Knuth-Bendix ordering constraints.
منابع مشابه
The Existential Theories of Term Algebras with the Knuth-Bendix Orderings are Decidable
We consider term algebras with simpliication orderings (which are mono-tonic, and well-founded). Solving constraints (quantiier-free formulas) in term algebras with this kind of orderings has several important applications like pruning search space in automated deduction and proving termination and connuence of term rewriting systems. Two kinds of ordering are normally used in automated deducti...
متن کاملSlothrop: Knuth-Bendix Completion with a Modern Termination Checker
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and resulting rewriting systems. While in principle any reduction ordering can be used, modern completion tools typically implement only Knuth-Bendix and path orderings. Consequently, the theories for which completion can possibly yield a decision procedure are limited to those...
متن کاملThe Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to prove the termination of rewriting systems. They are also applied in ordered resolution to prune the search space without compromising refutational completeness. Solving ordering constraints is therefore essential to t...
متن کاملKBlab: An Equational Theorem Prover for the Macintosh
KBlab is a Completion based theorem prover for equational logic, written in the language C and developed on the Macintosh in the MPW (Macintosh Programmer Workshop) programming environment. The core of KBlab is the Knuth–Bendix Completion Procedure (KB) [9,7,1], extended to Unfailing Knuth– Bendix (UKB) [5], S–strategy [5] and inductive theorem proving (IKB). IKB implements the Huet–Hullot meth...
متن کاملAn Extension of the Knuth-Bendix Ordering with LPO-Like Properties
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it poss...
متن کامل